Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Patil, B. P.
- Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning
Abstract Views :145 |
PDF Views:0
Authors
Rahul Desai
1,
B. P. Patil
2
Affiliations
1 Sinhgad College of Engineering, Information Tech. Department, Army Institute of Technology, Savitribai Phule Pune University, IN
2 E&TC Department, Army Institute of Technology, Savitribai Phule Pune University, IN
1 Sinhgad College of Engineering, Information Tech. Department, Army Institute of Technology, Savitribai Phule Pune University, IN
2 E&TC Department, Army Institute of Technology, Savitribai Phule Pune University, IN
Source
International Journal of Advanced Networking and Applications, Vol 9, No 2 (2017), Pagination: 3391-3395Abstract
In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 nodes MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.Keywords
DSDV, AODV, DSR, Q Routing, CBQ Routing, DRQ Routing, CDRQ Routing.Full Text
References
- M. Imran and M. A. Qadeer, "Evaluation Study of Performance Comparison of Topology Based Routing Protocol, AODV and DSDV in MANET," 2016 International Conference on Micro-Electronics and Telecommunication Engineering, Ghaziabad, 2016, pp. 207-211.
- C. Cheng, R. Riley and S.P.R. Kumar, “A loop-free extended Bellman–Ford routing protocol without bouncing effect” , Proc. of ACM SIGCOMM Conf. , 1989, pp. 224– 236.
- M. K. Marina and S. R. Das, “Ad-hoc on-demand multi-path distance vector routing,” Wireless Communication. Mobile Computing, vol. 6, no. 7, 2006, pp. 969–988
- C. E. Perkins, E. M. Royer, and S. Das, “Ad hoc ondemand distance vector routing,'' document RFC 3561, IETF, Oct. 2003
- C. Liu, Y. Shu, and Y. Zhou, et al., “A comparison of DSR, MSR and BSR in wireless ad-hoc networks,” SPIE, vol. 6011, 2005, pp. 601–610.
- Fahimeh Farahnakian. "Q-learning based congestionaware routing algorithm for onchip network", 2011 IEEE 2nd International Conference on Networked Embedded Systems for Enterprise Applications, 12/2011
- Parag Kulkarni, "Introduction to Reinforcement and Systemic Machine Learning," in Reinforcement and Systemic Machine Learning for Decision Making , 1, Wiley-IEEE Press, 2012, pp.1-21
- S. Nuuman, D. Grace and T. Clarke, "A quantum inspired reinforcement learning technique for beyond next generation wireless networks," 2015 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), New Orleans, LA, 2015, pp. 271-275.
- M. N. ul Islam and A. Mitschele-Thiel, "Reinforcement learning strategies for self-organized coverage and capacity optimization," 2012 IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, 2012, pp. 2818-2823.
- Oussama Souihli, Mounir Frikha, Mahmoud Ben Hamouda, "Load-balancing in MANET shortest-path routing protocols", Ad Hoc Networks, Volume 7, Issue 2, March 2009, Pages 431-442
- Ouzecki, D.; Jevtic, D., "Reinforcement learning as adaptive network routing of mobile agents," MIPRO, 2010 Proceedings of the 33rd International Convention , pp.479,484, 24-28 May 2010
- Ramzi A. Haraty and Badieh Traboulsi “MANET with the Q-Routing Protocol” ICN 2012 : The Eleventh International Conference on Networks
- S Kumar, Confidence based Dual Reinforcement Q Routing : An on line Adaptive Network Routing Algorithm. Technical Report, University of Texas, Austin 1998.
- Kumar, S., 1998, “Confidence based Dual Reinforcement Q-Routing: An On-line Adaptive Network Routing Algorithm, “Master’s thesis, Department of Computer Sciences, The University of Texas at Austin, TX-78712, USA Tech. Report AI98-267.
- Kumar, S., Miikkulainen, R., 1997, “Dual Reinforcement Q-Routing: An On-line Adaptive Routing Algorithm,’’ Proc. Proceedings of the Malaysian Journal of Computer, Vol. 17 No. 2, December 2004, pp.21-29
- Artificial Neural Networks in Engineering Conference.
- Shalabh Bhatnagar, K. Mohan Babu “ New Algorithms of the Q-learning type” Science Direct Automatica 44 (2008} 1111-1119. Website: www.sciencedirect.com
- Soon Teck Yap and Mohamed Othman, “An Adaptive Routing Algorithm: Enhanced Confidence Based Q Routing Algorithm in Network Traffic.
- Rahul Desai, B P Patil, “Analysis of Reinforcement Based Adaptive Routing in MANET”, Indonesian Journal of Electrical Engineering and Computer Science Vol. 2, No.3, June 2016, pp.684-694
- Moore, A.W., Atkeson, C.G., Prioritized Sweeping: Reinforcement Learning with less data and less time.
- Machine Learning, Vol. 13, 1993
- PAPR Reduction Using Modified Selective Mapping Technique
Abstract Views :108 |
PDF Views:0
Authors
V. B. Malode
1,
B. P. Patil
2
Affiliations
1 Department of Electronics, J.N.E.C., N-6, CIDCO, Aurangabad, IN
2 Department of Electronics, M.A.E., Alandi, Pune, IN
1 Department of Electronics, J.N.E.C., N-6, CIDCO, Aurangabad, IN
2 Department of Electronics, M.A.E., Alandi, Pune, IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 2 (2010), Pagination: 626-630Abstract
Multi-carrier modulation is an attractive technique for fourth generation wireless communication. Orthogonal Frequency Division Multiplexing (OFDM) is multi-carrier transmission scheme. Its high Peak to Average Power Ratio (PAPR) of the transmitted signal is a major drawback. In this paper, we propose to reduce PAPR by probabilistic method Modified selective mapping technique using the standard arrays of linear block codes. We choose lowest PAPR in each coset of a linear block codes as its coset leader from several transmitted signal. Simulation results show that PAPR results are better as compared to earlier work done by Yang Jie,Chen Lei et al. The paper also compared PAPR QPSK/DQPSK-OFDM with and without SLM.Keywords
OFDM, SLM, PAPR, LBC, QPSK, DQPSK.Full Text
- Experimentation for Packet Loss on MSP430 and nRF24L01 Based Wireless Sensor Network
Abstract Views :134 |
PDF Views:0
Authors
Affiliations
1 Department of Electronics Engineering, Maharashtra Academy of Engineering, Alandi (Pune), Maharashtra, IN
2 Department of Electronics & Instrumentation Engineering, Indian School of Mines University, Dhanbad-826004, Jharkhand, IN
1 Department of Electronics Engineering, Maharashtra Academy of Engineering, Alandi (Pune), Maharashtra, IN
2 Department of Electronics & Instrumentation Engineering, Indian School of Mines University, Dhanbad-826004, Jharkhand, IN
Source
International Journal of Advanced Networking and Applications, Vol 1, No 1 (2009), Pagination: 25-29Abstract
In this paper, a new design of wireless sensor network (WSN) node is discussed which is based on components with ultra low power. We have developed a Low cost and low power WSN Node using MSP430 and nRF24L01. The architectural circuit details are presented. This architecture fulfils the requirements like low cost, low power, compact size and self-organization. Various tests are carried out to test the performance of the nRF24L01 module. The packet loss, free Space loss (FSL) and battery lifetime calculations are described. These test results will help the researchers to build new applications using above node and to work efficiently with nRF24L01.Keywords
Wireless Sensor Networks, MSP430, nRF24L01, Free Space Loss, Battery Lifetime, Packet Loss.Full Text